Reducing Randomness via Irrational Numbers

On Irrational and Transcendental Numbers

Unsymmetrical Approximation of Irrational Numbers

1 A 1 < £ < , 5B B SB so that we have the classical theorem of Hurwitz. For other values of r, approximations from both sides are permitted, but the errors allowed on the two sides are different; hence the term unsymmetrical approximation. The result here was new, and is so related to Hurwitz's inequality that one side is strengthened and the other weakened. Notice that the result for r > l is ...

Representing numbers: prime and irrational

This article draws an analogy between prime and irrational numbers with respect to how these numbers are defined and how they are perceived by learners. Excerpts are presented from two research studies: a study on understanding prime numbers by pre-service elementary school teachers and a study on understanding irrational numbers by pre-service secondary school teachers. Considering the results...

Reducing Randomness in Computation

OF THE DISSERTATION Reducing Randomness in Computation via Explicit Constructions by Shiyu Zhou Dissertation Director: Professor Michael Saks One of the important issues in both complexity theory and algorithmdesign is to understand whether randomness can be more powerful than determinism. In this dissertation, we explore some problems related to this issue and study how to reduce randomness in...

Continued Fractions, Fibonacci Numbers, and Some Classes of Irrational Numbers

In this paper we define an equivalence relation on the set of positive irrational numbers less than 1. The relation is defined by means of continued fractions. Equivalence classes under this relation are determined by the places of some elements equal to 1 (called essential 1’s) in the continued fraction expansion of numbers. Analysis of suprema of all equivalence classes leads to a solution wh...